FSA Utilities: A Toolbox to Manipulate Finite-State Automata
نویسنده
چکیده
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate nite-state automata and nite-state transducers. Manipulations include determinization (both for nite-state accep-tors and nite-state transducers), minimization, composition, comple-mentation, intersection, Kleene closure, etc. Furthermore, various visu-alization tools are available to browse nite-state automata. The toolbox is implemented in SICStus Prolog.
منابع مشابه
[8] Karl Fogel, Open Source Development With CVS, The Coriolis Group
[1] Lauri Karttunen, Tamas Gaal, Andre Kempe, Xerox Finite-State Tool, Xerox Corporation, 1997. [2] Xerox Corporation, Syntax and Semantics of Regular Expressions, http://www.xrce.xerox.com [3] Xerox Corporation, Examples of Networks and Regular Expressions, http://www.xrce.xerox.com [4] Lauri Karttunen, Application of Finite-State Transducers in Natural-Language Processing, Xerox Research Cent...
متن کاملXFST2FSA: Comparing Two Finite-State Toolboxes
This paper introduces xfst2fsa, a compiler which translates grammars expressed in the syntax of the XFST finite-state toolbox to grammars in the language of the FSA Utilities package. Compilation to FSA facilitates the use of grammars developed with the proprietary XFST toolbox on a publicly available platform. The paper describes the non-trivial issues of the compilation process, highlighting ...
متن کاملFinite State Automata that Recurrent Cascade-Correlation Cannot Represent
This paper relates the computational power of Fahlman' s Recurrent Cascade Correlation (RCC) architecture to that of fInite state automata (FSA). While some recurrent networks are FSA equivalent, RCC is not. The paper presents a theoretical analysis of the RCC architecture in the form of a proof describing a large class of FSA which cannot be realized by RCC.
متن کاملImage Representation Using Finite State Automata
Image representation using quadtrees is useful in many applications and is well known in computer graphics. It has been shown that we can represent quadtrees asrationallanguages that are recognizable by finite state automata (FSA) [1]. These FSA can use less memory and are more flexible than their corresponding quadtrees. Binary image representation using FSA follows these two main steps: (1) F...
متن کاملRecursive Parametric Automata and -Removal
This work is motivated by and arose from the parametric verification of communication protocols over unbounded channels, where the channel capacity is the parameter. Verification required the use of finite state automata (FSA) reduction, including -removal, for a specific infinite family of FSA. This paper generalises this work by introducing Recursive Parametric FSA (RP-FSA), an infinite famil...
متن کامل